Chebyshev’s bias in dihedral and generalized quaternion Galois groups
نویسندگان
چکیده
We study the inequities in distribution of Frobenius elements Galois extensions rational numbers with groups that are either dihedral $D_{2n}$ or (generalized) quaternion $\mathbb H_{2n}$ two-power order. In spirit recent work Fiorilli and Jouve arXiv:2001.05428, we study, under natural hypotheses, some families such extensions, a horizontal aspect, where degree is fixed, vertical goes to infinity. Our main contribution uncovers phenomenon, for which Ng gave numerical evidence : real zeros Artin L-functions sometimes have radical influence on elements.
منابع مشابه
Hurwitz Equivalence in Tuples of Generalized Quaternion Groups and Dihedral Groups
Let Q2m be the generalized quaternion group of order 2 m and DN the dihedral group of order 2N . We classify the orbits in Q2m and D n pm (p prime) under the Hurwitz action. 1 The Hurwitz Action Let G be a group. For a, b ∈ G, let a = bab and a = bab. The Hurwitz action on G (n ≥ 2) is an action of the n-string braid group Bn on G . Recall that Bn is given by the presentation Bn = 〈σ1, . . . , ...
متن کاملOn the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملOn Hamilton Circuits in Cayley Digraphs over Generalized Dihedral Groups
In this paper we prove that given a generalized dihedral group DH and a generating subset S, if S∩H 6= ∅ then the Cayley digraph → Cay(DH , S) is Hamiltonian. The proof we provide is via a recursive algorithm that produces a Hamilton circuit in the digraph.
متن کاملHamilton paths in Cayley graphs on generalized dihedral groups
We investigate the existence of Hamilton paths in connected Cayley graphs on generalized dihedral groups. In particular, we show that a connected Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamiltonconnected, unless it is bipartite, in which case it is Hamilton-laceable.
متن کاملSumsets in dihedral groups
Let Dn be the dihedral group of order 2n. For all integers r, s such that 1 ≤ r, s ≤ 2n, we give an explicit upper bound for the minimal size μDn (r, s) = min |A · B| of sumsets (product sets) A · B, where A and B range over all subsets of Dn of cardinality r and s respectively. It is shown by construction that μDn (r, s) is bounded above by the known value of μG (r, s), where G is any abelian ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra & Number Theory
سال: 2021
ISSN: ['1944-7833', '1937-0652']
DOI: https://doi.org/10.2140/ant.2021.15.999